Nominal Lawvere Theories
نویسنده
چکیده
Lawvere theories provide a category theoretic view of equational logic, identifying equational theories with small categories equipped with finite products. This formulation allows equational theories to be investigated as first class mathematical entities. However, many formal systems, particularly in computer science, are described by equations modulated by side conditions asserting the “freshness of names”; these may be expressed as theories of Nominal Equational Logic (NEL). This paper develops a correspondence between NEL-theories and certain categories that we call nominal Lawvere theories.
منابع مشابه
Nominal Lawvere Theories: A category theoretic account of equational theories with names
Names, or object-level variables, are a ubiquitous feature in programming languages and other computational applications. Reasoning with names, and related constructs like binding and freshness, often poses conceptual and technical challenges. Nominal Equational Logic (NEL) is a logic for reasoning about equations in the presence of freshness side conditions. This paper gives a category theoret...
متن کاملRepresenting operational semantics with enriched Lawvere theories
Many term calculi, like λ-calculus or π-calculus, involve binders for names, and the mathematics of bound variable names is subtle. Schönfinkel introduced the SKI combinator calculus in 1924 to clarify the role of quantified variables in intuitionistic logic by eliminating them. Yoshida demonstrated how to eliminate the bound names coming from the input prefix in the asynchronous π-calculus, bu...
متن کاملFreyd categories are Enriched Lawvere Theories
Lawvere theories provide a categorical formulation of the algebraic theories from universal algebra. Freyd categories are categorical models of first-order effectful programming languages. The notion of sound limit doctrine has been used to classify accessible categories. We provide a definition of Lawvere theory that is enriched in a closed category that is locally presentable with respect to ...
متن کاملDiscrete Lawvere theories and computational effects
Countable Lawvere theories model computational effects such as exceptions, side-effects, interactive input/output, nondeterminism and probabilistic nondeterminism. The category of countable Lawvere theories has sums, tensors, and distributive tensors, modelling natural combinations of such effects. It is also closed under taking images. Enrichment in a category such as Cpo allows one to extend ...
متن کاملGabriel-Ulmer duality and Lawvere theories enriched over a general base
Motivated by the search for a body of mathematical theory to support the semantics of computational effects, we first recall the relationship between Lawvere theories and monads on Set. We generalise that relationship from Set to an arbitrary locally presentable category such as Poset, ωCpo, or functor categories such as [Inj, Set] or [Inj, ωCpo]. That involves allowing the arities of Lawvere t...
متن کامل